Consistently Estimating Markov Chains with Noisy Aggregate Data
نویسندگان
چکیده
We address the problem of estimating the parameters of a time-homogeneous Markov chain given only noisy, aggregate data. This arises when a population of individuals behave independently according to a Markov chain, but individual sample paths cannot be observed due to limitations of the observation process or the need to protect privacy. Instead, only population-level counts of the number of individuals in each state at each time step are available. When these counts are exact, a conditional least squares (CLS) estimator is known to be consistent and asymptotically normal. We initiate the study of method of moments estimators for this problem to handle the more realistic case when observations are additionally corrupted by noise. We show that CLS can be interpreted as a simple “plug-in” method of moments estimator. However, when observations are noisy, it is not consistent because it fails to account for additional variance introduced by the noise. We develop a new, simpler method of moments estimator that bypasses this problem and is consistent under noisy observations.
منابع مشابه
Empirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملReduced Spatio-Temporal Complexity MMPP and Image-Based Tracking Filters for Maneuvering Targets
There is significant motivation to develop reduced-complexity filtering algorithms (with explicit performance bounds) for tracking maneuvering targets. Maneuvering target estimation is an important problem in target tracking due to the uncertainty in maneuvers of the target. In a hostile environment a target will try to avoid being tracked by maneuvering in such a way so that its motion is diff...
متن کاملTriplet Partially Markov Chains and Trees
Hidden Markov models (HMM), like chains or trees considered in this paper, are widely used in different situations. Such models, in which the hidden process X is a Markov one, allow one estimating the latter from an observed process Y , which can be seen as a noisy version of X . This is possible once the distribution of X conditional on Y is a Markov distribution. These models have been recent...
متن کاملBehavioral Foundations for Conditional Markov Models of Aggregate Data
Conditional Markov chain models of observed aggregate share–type data have been used by economic researchers for several years, but the classes of models commonly used in practice are often criticized as being purely ad hoc because they are not derived from micro–behavioral foundations. The primary purpose of this paper is to show that the estimating equations commonly used to estimate these co...
متن کاملThe Rate of Rényi Entropy for Irreducible Markov Chains
In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.
متن کامل